High Performance Transactions via Early Write Visibility
نویسندگان
چکیده
In order to guarantee recoverable transaction execution, database systems permit a transaction’s writes to be observable only at the end of its execution. As a consequence, there is generally a delay between the time a transaction performs a write and the time later transactions are permitted to read it. This delayed write visibility can significantly impact the performance of serializable database systems by reducing concurrency among conflicting transactions. This paper makes the observation that delayed write visibility stems from the fact that database systems can arbitrarily abort transactions at any point during their execution. Accordingly, we make the case for database systems which only abort transactions under a restricted set of conditions, thereby enabling a new recoverability mechanism, early write visibility, which safely makes transactions’ writes visible prior to the end of their execution. We design a new serializable concurrency control protocol, piece-wise visibility (PWV), with the explicit goal of enabling early write visibility. We evaluate PWV against state-of-the-art serializable protocols and a highly optimized implementation of read committed, and find that PWV can outperform serializable protocols by an order of magnitude and read committed by 3X on high contention workloads.
منابع مشابه
Real-Time Point-Based Rendering Using Visibility Map
Because of its simplicity and intuitive approach, pointbased rendering has been a very popular research area. Recent approaches have focused on hardware-accelerated techniques. By applying a deferred shading scheme, both high-quality images and high-performance rendering have been achieved. However, previous methods showed problems related to depth-based visibility computation. We propose an ex...
متن کاملTransactional Scheduling for Read-Dominated Workloads
The transactional approach to contention management guarantees atomicity by aborting transactions that may violate consistency. A major challenge in this approach is to schedule transactions in a manner that reduces the total time to perform all transactions (the makespan), since transactions are often aborted and restarted. The performance of a transactional scheduler can be evaluated by the r...
متن کاملHigh Performance Multi-Partition Transactions
This PhD project addresses high throughput multi-partition, multi-get/put transactions, a.k.a. read-only/write-only transactions, in distributed storage systems providing strong consistency, specifically serializability, on various workload changes. Current systems either sacrifice performance for concurrency control, or trade consistency for performance. The project takes a new angle on the pr...
متن کاملDesign and Implementation of Workflow Based Yard Management System
In this paper, we address workflow management system for automatically operating yard management system which can fill up a gap between transportation and warehouse management system in supply chain management. But, it is difficult to find an optimal solution for yard operation problems because of its dynamic complexities. Instead, we propose workflow management system which describes the autom...
متن کاملOptimistic Aborts for Geo-distributed Transactions
Network latency can have a significant impact on the performance of transactional storage systems, particularly in wide area or geo-distributed deployments. To reduce latency, systems typically rely on a cache to service read-requests closer to the client. However, caches are not effective for write-heavy workloads, which have to be processed by the storage system in order to maintain serializa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- PVLDB
دوره 10 شماره
صفحات -
تاریخ انتشار 2017